Recurrence of cocycles and stationary random walks
نویسندگان
چکیده
We survey distributional properties of R-valued cocycles of finite measure preserving ergodic transformations (or, equivalently, of stationary random walks in R) which determine recurrence or transience. Let (Xn, n ≥ 0) be an ergodic stationary Rd-valued stochastic process, and let (Yn = X0 + · · · + Xn−1, n ≥ 1) be the associated random walk. What can one say about recurrence of this random walk if one only knows the distributions of the random variables Yn, n ≥ 1? It turns out that methods from ergodic theory yield some general sufficient conditions for recurrence of such random walks without any assumptions on independence properties or moments of the process (Xn). Most of the results described in this note have been published elsewhere. Only the Theorems 12 and 14 on recurrence of symmetrized random walks are — to my knowledge — new. Let us start our discussion by formulating the recurrence problem in the language of ergodic theory. Let T be a measure preserving ergodic automorphism of a probability space (X, S, μ), d ≥ 1, and let f : X −→ R be a Borel map. The cocycle f : Z×X −→ Rd is given by
منابع مشابه
A PRELUDE TO THE THEORY OF RANDOM WALKS IN RANDOM ENVIRONMENTS
A random walk on a lattice is one of the most fundamental models in probability theory. When the random walk is inhomogenous and its inhomogeniety comes from an ergodic stationary process, the walk is called a random walk in a random environment (RWRE). The basic questions such as the law of large numbers (LLN), the central limit theorem (CLT), and the large deviation principle (LDP) are ...
متن کاملRecurrence and ergodicity of random walks on linear groups and on homogeneous spaces
We discuss recurrence and ergodicity properties of random walks and associated skew products for large classes of locally compact groups and homogeneous spaces. In particular we show that a closed subgroup of a product of finitely many linear groups over local fields supports a recurrent random walk if and only if it has at most quadratic growth. We give also a detailed analysis of ergodicity p...
متن کاملRandom-walk approximation to vacuum cocycles
Quantum random walks are constructed on operator spaces using the concept of matrix-space lifting, a form of ampliation intermediate between those given by spacial and ultraweak tensor products. It is shown that these walks, after suitable scaling, converge in a strong sense to vacuum cocycles, certain vacuum-adapted processes which are Feller cocycles in the sense of Lindsay and Wills. This re...
متن کاملar X iv : m at h / 07 03 33 9 v 1 [ m at h . FA ] 1 2 M ar 2 00 7 APPROXIMATION OF QUANTUM LÉVY PROCESSES BY QUANTUM RANDOM WALKS
Every quantum Lévy process with a bounded stochastic generator is shown to arise as a strong limit of a family of suitably scaled quantum random walks. The note is concerned with investigating convergence of random walks on quantum groups to quantum Lévy processes. The theory of the latter is a natural non-commutative counterpart of the theory of classical Lévy processes on groups ([Hey]). It h...
متن کاملFirst Hitting times of Simple Random Walks on Graphs with Congestion Points
We derive the explicit formulas of the probability generating functions of the first hitting times of simple random walks on graphs with congestion points using group representations. 1. Introduction. Random walk on a graph is a Markov chain whose state space is the vertex set of the graph and whose transition from a given vertex to an adjacent vertex along an edge is defined according to some ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006